Split and ST Bisimulation Semantics

نویسندگان

  • Roberto Gorrieri
  • Cosimo Laneve
چکیده

In this paper the notion of action atomicity is relaxed by permitting actions to be observed in the middle of their evolution. Non atomic semantic equivalences, based on the notion of bisimulation, are studied over stable event structures. Splitn bisimulation equivalence (denoted n ) considers each event as composed of n phases. ST bisimulation equivalence (denoted ST ) is a slight refinement of 2 where each ending phase is unambiguously associated to a beginning phase. We prove that, by increasing n, we get finer and finer equivalences (i.e. n+1 n ) and, moreover, that n+1 coincides with ST over those event structures whose autoconcurrency is at most n. The main consequence of these results is that, for image finite event structures, ST is the intersection of all the n . This paper will appear in Information and Computation. 1. The first author has been partially supported by the Italian CNR, grant n. 92.00069.CT12.115.25585, and the second author by Progetto Finalizzato “Calcolo Parallelo e Informatica” (obiettivo LAMBRUSCO) and Hewlett Packard Pisa Science Centre. 2. Dipartimento di Matematica, Università di Bologna, Piazza di Porta San Donato 5, I-40127 Bologna, Italy. E-mail: [email protected] 3. Dipartimentodi Informatica –Università di Pisa,Corso Italia 40, I-56125,Pisa, Italy. E-mail: [email protected]

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Deadlock Behaviour in Split and ST Bisimulation Semantics

We investigate split and ST bisimulation semantics, in particular the deadlock behaviour of processes in these semantics. \"le define and axiomatise a variant of ACP, where atomic actions and durational actions coexist, and define split and ST bisimulation semantics on this theory. We exhibit a closed term that has a deadlock in split semantics, but not in ST bisimulation semantics, and vice ve...

متن کامل

Relating maximality-based semantics to action refinement in process algebras

This paper extends to process algebras the notion of maximality which has initially been introduced for prime event structures and P/T nets and shows how this notion of maximality may be used for deening an adequate semantics of Basic LOTOS able to support action reenement. Such an approach appears to be more convenient than the classical ST-semantics where non atomic actions are split into sta...

متن کامل

Deciding and Axiomatizing St Bisimulation for (interleaving) Nite State Processes

We propose a technique for expressing the ST semantics in SOS style for terms of a process algebra. This technique, which is based on the idea of giving unique names to actions and reusing the names of terminated actions, allows us to decide and axiomatize weak ST bisimu-lation for all processes that possess a nite state interleaving semantics. Moreover we show that the proposed technique allow...

متن کامل

Axiomatizing St Bisimulation for a Process Algebra with Recursion and Action Reenement (extended Abstract)

Due to the complex nature of bisimulation equivalences which express some form of history dependence, it turned out to be problematic to axiomatize them for non trivial classes of systems. Here we introduce the idea of \compositional level-wise renaming" which gives rise to the new possibility of axiomatizing the class of history dependent bisimulations with slight modiications to the machinery...

متن کامل

Deciding and Axiomatizing ST Bisimulation for a Process Algebra with Recursion and Action Refinement

We propose two techniques for expressing the ST semantics for terms of a process algebra. The first technique, which is more intuitive, is based on the idea of giving unique names to actions and allows to decide and axiomatize weak ST bisimulation for all processes that possess a finite state interleaving semantics. The second technique, which is based on pointers, allows to preserve the possib...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Inf. Comput.

دوره 118  شماره 

صفحات  -

تاریخ انتشار 1995